package com.wc.AlgoOJ_train.train1.c0.A009;

import java.util.Scanner;

/**
 * @Author congege
 * @Description 求数列的和
 * http://43.138.190.70:8888/p/A009
 * @Date Created in 2023/12/24-21:41
 */
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            double n = sc.nextInt();
            int m = sc.nextInt();
            double ans = n;
            while (--m > 0) {
                n = Math.pow(n, 0.5);
                ans += n;
            }
            System.out.printf("%.2f\n",ans);
        }
    }
}
